4,586 research outputs found

    Review Of Hiring And Firing Public Officials: Rethinking The Purpose Of Elections By J. Buchler

    Get PDF

    Mesino Oscillation in MFV SUSY

    Full text link
    R-parity violating supersymmetry in a Minimal Flavor Violation paradigm can produce same-sign dilepton signals via direct sbottom-LSP pair production. Such signals arise when the sbottom hadronizes and the resulting mesino oscillates into an anti-mesino. The first bounds on the sbottom mass are placed in this scenario using current LHC results.Comment: 14 pages, 6 figure

    Deconstruction: Large Hadron Collider

    Get PDF
    As the world’s largest science experiment, the LHC is the subject of many interesting and unusual facts and statistics

    A Dream In Crisis

    Get PDF

    Metrosexual Manliness: Tocqueville\u27s New Science Of Energy

    Get PDF

    Attention Deficit Democracy: The Paradox Of Civic Engagement

    Get PDF

    Brief Announcement: Zero-Knowledge Protocols for Search Problems

    Get PDF
    We consider natural ways to extend the notion of Zero-Knowledge (ZK) Proofs beyond decision problems. Specifically, we consider search problems, and define zero-knowledge proofs in this context as interactive protocols in which the prover can establish the correctness of a solution to a given instance without the verifier learning anything beyond the intended solution, even if it deviates from the protocol. The goal of this work is to initiate a study of Search Zero-Knowledge (search-ZK), the class of search problems for which such systems exist. This class trivially contains search problems where the validity of a solution can be efficiently verified (using a single message proof containing only the solution). A slightly less obvious, but still straightforward, way to obtain zero-knowledge proofs for search problems is to let the prover send a solution and prove in zero-knowledge that the instance-solution pair is valid. However, there may be other ways to obtain such zero-knowledge proofs, and they may be more advantageous. In fact, we prove that there are search problems for which the aforementioned approach fails, but still search zero-knowledge protocols exist. On the other hand, we show sufficient conditions for search problems under which some form of zero-knowledge can be obtained using the straightforward way
    • …
    corecore